Ela on Λ 1 - Extremal Non - Regular Graphs ∗
نویسنده
چکیده
Let G be a connected non-regular graph with n vertices, maximum degree ∆ and minimum degree δ, and let λ1 be the greatest eigenvalue of the adjacency matrix of G. In this paper, by studying the Perron vector of G, it is shown that type-I-a graphs and type-I-b (resp. type-II-a) graphs with some specified properties are not λ1-extremal graphs. Moreover, for each connected non-regular graph some lower bounds on the difference between ∆ and λ1 are obtained.
منابع مشابه
Some Extremal Problems for Edge-Regular Graphs
We consider the class ER(n, d, λ) of edge-regular graphs for some n > d > λ, i.e., graphs regular of degree d on n vertices, with each pair of adjacent vertices having λ common neighbors. It has previously been shown that for such graphs with λ > 0 we have n ≥ 3(d − λ) and much has been done to characterize such graphs when equality holds. Here we show that n ≥ 3(d − λ) + 1 if λ > 0 and d is od...
متن کاملEla Strongly Regular Graphs : Values of Λ and Μ For
Dedicated to the memory of Prof. Dom de Caen Abstract. Given λ and μ, it is shown that, unless one of the relations (λ− μ)2 = 4μ, λ− μ = −2, (λ− μ)2 + 2(λ− μ) = 4μ is satisfied, there are only finitely many parameter sets (v, k, λ, μ) for which a strongly regular graph with these parameters could exist. This result is used to prove as special cases a number of results which have appeared in pre...
متن کاملDual polar spaces as extremal distance-regular graphs
A new inequality for the parameters of distance-regular graphs is proved. It implies that if there are infinitely many distance-regular graphs with fixed λ,μ, ai and ci containing an induced quadrangle then necessarily ci+1 ≥ 1+(μ−1)ci . As the dual polar graphs show, this inequality is best possible. Some related results are also discussed. © 2003 Elsevier Ltd. All rights reserved.
متن کاملFrom regular boundary graphs to antipodal distance-regular graphs
Let Γ be a regular graph with n vertices, diameter D, and d + 1 different eigenvalues λ > λ1 > · · · > λd. In a previous paper, the authors showed that if P (λ) > n − 1, then D ≤ d − 1, where P is the polynomial of degree d−1 which takes alternating values±1 atλ1, . . . , λd. The graphs satisfying P (λ) = n − 1, called boundary graphs, have shown to deserve some attention because of their rich ...
متن کاملProperties of Certain Families of 2k-Cycle-Free Graphs
Let v = v(G) and e = e(G) denote the order and size of a simple graph G, respectively. Let G = {Gi}i≥1 be a family of simple graphs of magnitude r > 1 and constant λ > 0, i.e. e(Gi) = (λ+ o(1))v(Gi), i→∞. For any such family G whose members are bipartite and of girth at least 2k + 2, and every integer t, 2 ≤ t ≤ k − 1, we construct a family G̃t of graphs of same magnitude r, of constant greater ...
متن کامل